Tree automaton

Results: 92



#Item
21Efficient Inclusion Testing for Simple Classes of Unambiguous ω-Automata Dimitri Isaaka , Christof L¨odinga a Informatik  7, RWTH Aachen, Germany

Efficient Inclusion Testing for Simple Classes of Unambiguous ω-Automata Dimitri Isaaka , Christof L¨odinga a Informatik 7, RWTH Aachen, Germany

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2012-05-29 11:02:30
22The Logic in Computer Science Column by Yuri Gurevich Microsoft Research One Microsoft Way, Redmond WA 98052, USA

The Logic in Computer Science Column by Yuri Gurevich Microsoft Research One Microsoft Way, Redmond WA 98052, USA

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2011-09-16 13:09:59
23String Suffix Automata and Subtree Pushdown Automata

String Suffix Automata and Subtree Pushdown Automata

Add to Reading List

Source URL: www.stringology.org

Language: English - Date: 2009-09-02 12:00:50
24Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2014-03-20 17:09:13
25Linear Time Algorithm for Identifying the Invertibility of Null-Boundary Three Neighborhood Cellular Automata

Linear Time Algorithm for Identifying the Invertibility of Null-Boundary Three Neighborhood Cellular Automata

Add to Reading List

Source URL: www.complex-systems.com

Language: English - Date: 2012-06-20 13:21:03
2615  Software Model Checking Using Languages of Nested Trees RAJEEV ALUR, University of Pennsylvania SWARAT CHAUDHURI, Rice University P. MADHUSUDAN, University of Illinois

15 Software Model Checking Using Languages of Nested Trees RAJEEV ALUR, University of Pennsylvania SWARAT CHAUDHURI, Rice University P. MADHUSUDAN, University of Illinois

Add to Reading List

Source URL: www.cs.rice.edu

Language: English - Date: 2013-01-28 13:27:14
27Electronic Communications of the EASST  Second International Workshop on Bidirectional Transformations (BXEdit languages for information trees

Electronic Communications of the EASST Second International Workshop on Bidirectional Transformations (BXEdit languages for information trees

Add to Reading List

Source URL: dmwit.com

Language: English - Date: 2013-05-07 00:40:33
28Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2014-03-20 17:09:13
29Parameterized Verification of Communicating Automata under Context Bounds Benedikt Bollig1 , Paul Gastin1 , and Jana Schubert2 1 LSV, ENS Cachan & CNRS {bollig,gastin}@lsv.ens-cachan.fr

Parameterized Verification of Communicating Automata under Context Bounds Benedikt Bollig1 , Paul Gastin1 , and Jana Schubert2 1 LSV, ENS Cachan & CNRS {bollig,gastin}@lsv.ens-cachan.fr

Add to Reading List

Source URL: www.lsv.ens-cachan.fr

Language: English - Date: 2014-09-19 10:50:53
30YakYak: Parsing with Logical Side Constraints Niels Damgaard 

YakYak: Parsing with Logical Side Constraints Niels Damgaard 

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 1999-12-15 06:18:13